Simplification of formula of meridian arc length amp; amp; program of general gauss projection
2.
The paper discusses the transformation problem between different types of coordinate systems , for example : the coordinate transformation between wgs - 84 coordinate system and beijing 54 coordinate system , the formula for gauss projection positive and negative computation in national stripes and any local projective stripes , and presents an algorithm . combined with some classic shortest path algorithms , this paper presents an efficient method of realize the shortest path algorithm which is based on dijkstra algorithm